home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
User's Choice Windows CD
/
User's Choice Windows CD (CMS Software)(1993).iso
/
misc1
/
iv26_w30.zip
/
SOURCES
/
TABLE2.C
< prev
next >
Wrap
C/C++ Source or Header
|
1992-03-25
|
3KB
|
112 lines
/*
* Copyright (c) 1989 Stanford University
*
* Permission to use, copy, modify, distribute, and sell this software and its
* documentation for any purpose is hereby granted without fee, provided
* that the above copyright notice appear in all copies and that both that
* copyright notice and this permission notice appear in supporting
* documentation, and that the name of Stanford not be used in advertising or
* publicity pertaining to distribution of the software without specific,
* written prior permission. Stanford makes no representations about
* the suitability of this software for any purpose. It is provided "as is"
* without express or implied warranty.
*
* STANFORD DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
* INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS.
* IN NO EVENT SHALL STANFORD BE LIABLE FOR ANY SPECIAL, INDIRECT OR
* CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
* DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
* OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION
* WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
/*
* Associative map between objects.
*/
#include <InterViews\table2.h>
class Table2Entry {
friend class Table2;
void* key1;
void* key2;
void* value;
Table2Entry* chain;
};
Table2::Table2 (int n) {
register Table2Entry** e;
size = 32;
while (size < n) {
size <<= 1;
}
first = new Table2Entry*[size];
--size;
last = &first[size];
for (e = first; e <= last; e++) {
*e = nil;
}
}
Table2::~Table2 () {
delete first;
}
inline Table2Entry* Table2::Probe (void* i1, void* i2) {
return first[((unsigned int)i1 + (unsigned int)i2) & size];
}
inline Table2Entry** Table2::ProbeAddr (void* i1, void* i2) {
return &first[((unsigned int)i1 + (unsigned int)i2) & size];
}
void Table2::Insert (void* k1, void* k2, void* v) {
register Table2Entry* e;
register Table2Entry** a;
e = new Table2Entry;
e->key1 = k1;
e->key2 = k2;
e->value = v;
a = ProbeAddr(k1, k2);
e->chain = *a;
*a = e;
}
boolean Table2::Find (void*& v, void* k1, void* k2) {
register Table2Entry* e;
for (e = Probe(k1, k2); e != nil; e = e->chain) {
if (e->key1 == k1 && e->key2 == k2) {
v = e->value;
return true;
}
}
return false;
}
void Table2::Remove (void* k1, void* k2) {
register Table2Entry* e, * prev;
Table2Entry** a;
a = ProbeAddr(k1, k2);
e = *a;
if (e != nil) {
if (e->key1 == k1 && e->key2 == k2) {
*a = e->chain;
delete e;
} else {
do {
prev = e;
e = e->chain;
} while (e != nil && (e->key1 != k1 || e->key2 != k2));
if (e != nil) {
prev->chain = e->chain;
delete e;
}
}
}
}